| 1. | Shortest path algorithm
最短路径算则 |
| 2. | Shortest path algorithm with real time traffic information in dynamic vehicle routing problem
动态车辆路径问题中的实时最短路径算法研究 |
| 3. | Shortest path algorithm based on limiting parallelogram and its application in traffic networks
平行四边形限制最短路径算法及其在交通网络中的应用 |
| 4. | An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4
对经典dijkstra最短路径搜索算法采用空间换时间的方法，提高了搜索效率； 4 |
| 5. | ( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part
( 2 )运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。 |
| 6. | We set focus on solutions which include the vector map representation of city road network , the abstraction and construction of the topological structure of network , and the efficient implementation of shortest path algorithm
其中，重点解决了城市道路网的矢量地图表达、网络拓扑结构的提取和构建、最短路径算法的高效实现等关键技术。 |
| 7. | ( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized . a motorcade - optimized dispatching software is realized . finally , future applications of the urban traffic flow guidance system are discussed
( 4 )用dijkstra算法实现了城市中两点间最短路径搜索，在此基础上，实现了基于电子地图的大型车队优化调度及管理的系统软件。 |
| 8. | Domain ontology can be modeled a simple directed acyclic network , subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ) , association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )
领域本体可以模型化为一个简单有向无环网络，概念之间的包含关系可以通过a ~ h中的(直接)前驱后继算法来求解，而概念之间的关联度可以通过a ~ h中的最短路径算法来求解。 |
